Exact Non-Markovian Evolution with Several Reservoirs
نویسندگان
چکیده
منابع مشابه
Non-Markovian Agent Evolution with EVOLP
Logic Programming Update Languages were proposed as an extension of logic programming, which allow for modelling the dynamics of knowledge bases where both extensional knowledge (facts) as well as intentional knowledge (rules) may change over time due to updates, with important application Multi-Agent Systems (MAS). Despite their generality, these languages do not provide means to directly acce...
متن کاملLocal evolution equations for non-Markovian processes
A Fokker-Planck equation approach for the treatment of non-Markovian stochastic processes is proposed. The approach is based on the introduction of fictitious trajectories sharing with the real ones their local structure and initial conditions. Different statistical quantities are generated by different construction rules for the trajectories, which coincide only in the Markovian case. The meri...
متن کاملSolving Non-Markovian Control Tasks with Neuro-Evolution
The success of evolutionary methods on standard control learning tasks has created a need for new benchmarks. The classic pole balancing problem is no longer difficult enough to serve as a viable yardstick for measuring the learning efficiency of these systems. The double pole case, where two poles connected to the cart must be balanced simultaneously is much more difficult, especially when vel...
متن کاملSolving constrained Markovian evolution in QCD with the help of the non-Markovian Monte Carlo
We present the constrained Monte Carlo (CMC) algorithm for the QCD evolution. The constraint resides in that the total longitudinal energy of the emissions in the MC and in the underlying QCD evolution is predefined (constrained). This CMC implements exactly the full DGLAP evolution of the parton distributions in the hadron with respect to the logarithm of the energy scale. The algorithm of the...
متن کاملExact and approximate moment closures for non-Markovian network epidemics.
Moment-closure techniques are commonly used to generate low-dimensional deterministic models to approximate the average dynamics of stochastic systems on networks. The quality of such closures is usually difficult to asses and furthermore the relationship between model assumptions and closure accuracy are often difficult, if not impossible, to quantify. Here we carefully examine some commonly u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics of Particles and Nuclei
سال: 2020
ISSN: 1063-7796,1531-8559
DOI: 10.1134/s1063779620040711